 #include<bits/stdc++.h>
#define int long long
using namespace std;
vector<int> v={1,1,1,3,4,5,7,9,21};
unordered_set<int> s;
multiset<int> s1={1,1,1,3,4,5,7,9,21};
signed main()
{
	sort(v.begin(),v.end());
	int pos=upper_bound(v.begin(),v.end(),6)-v.begin();
	cout<<pos<<endl; 
	cout<<*s1.lower_bound(6)<<s1[2];
	return 0;
}
